A Linear Matrix Inequality Approach toH 1

نویسنده

  • Pierre Apkarian
چکیده

The continuous-and discrete-time H 1 control problems are solved via elementary manipulations on linear matrix inequalities (LMI). Two interesting new features emerge through this approach: solvability conditions valid for both regular and singular problems , and an LMI-based parametrization of all H 1-suboptimal controllers, including reduced-order controllers. The solvability conditions involve Riccati inequalities rather than the usual indee-nite Riccati equations. Alternatively, these conditions can be expressed as a system of three LMI's. EEcient convex optimization techniques are available to solve this system. Moreover, its solutions parametrize the set of H 1 controllers and bear important connections with the controller order and the closed-loop Lyapunov functions. Thanks to such connections, the LMI-based characterization of H 1 controllers opens new perspectives for the reenement of H 1 design. Applications to cancellation-free design and controller order reduction are discussed and illustrated by examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear matrix inequality approach for synchronization of chaotic fuzzy cellular neural networks with discrete and unbounded distributed delays based on sampled-data control

In this paper, linear matrix inequality (LMI) approach for synchronization of chaotic fuzzy cellular neural networks (FCNNs) with discrete and unbounded distributed delays based on sampled-data controlis investigated. Lyapunov-Krasovskii functional combining with the input delay approach as well as the free-weighting matrix approach are employed to derive several sufficient criteria in terms of...

متن کامل

A Linear Matrix Inequality (LMI) Approach to Robust Model Predictive Control (RMPC) Design in Nonlinear Uncertain Systems Subjected to Control Input Constraint

In this paper, a robust model predictive control (MPC) algorithm is addressed for nonlinear uncertain systems in presence of the control input constraint. For achieving this goal, firstly, the additive and polytopic uncertainties are formulated in the nonlinear uncertain systems. Then, the control policy can be demonstrated as a state feedback control law in order to minimize a given cost funct...

متن کامل

A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems

We consider a class of matrix spectral norm approximation problems for finding an affine combination of given matrices having the minimal spectral norm subject to some prescribed linear equality and inequality constraints. These problems arise often in numerical algebra, engineering and other areas, such as finding Chebyshev polynomials of matrices and fastest mixing Markov chain models. Based ...

متن کامل

The Kreiss Matrix Theorem on a General Complex Domain

Let A be a bounded linear operator in a Hilbert space H with spectrum Λ(A). The Kreiss matrix theorem gives bounds based on the resolvent norm ‖(zI−A)−1‖ for ‖An‖ if Λ(A) is in the unit disk or for ‖etA‖ if Λ(A) is in the left half-plane. We generalize these results to a complex domain Ω, giving bounds for ‖Fn(A)‖ if Λ(A) ⊂ Ω, where Fn denotes the nth Faber polynomial associated with Ω. One of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994